The Lattice of Data Reenement
نویسنده
چکیده
We deene a very general notion of data reenement which comprises the traditional notion of data reenement as a special case. Using the concepts of duals and adjoints we deene converse commands and a nd a symmetry between ordinary data reenement and a dual (backward) data reenement. We show how ordinary and backward data reenement are interpreted as simulation and we derive rules for the piecewise data reenement of programs. Our results are valid for a general language, covering demonic and angelic nondeterminism as well as nontermination and miracles.
منابع مشابه
Re nement and State Machine
Most SVRC technical reports are available via anonymous ftp, from svrc.it.uq.edu.au in the directory /pub/techreports. Abstracts and compressed postscript les are available via Abstract Precise module interface speciications are essential in modular software development. The role of state in these speciications has been the issue of some debate and is central to the notion of data reenement. In...
متن کاملDithered lattice-based quantizers for multiple descriptions
Multiple description source coding is aimed at achieving graceful degradation in reconstruction with respect to losing portions of the code, with the cost of some redundancy. We examine multiple description schemes which use en-tropy coded dithered lattice quantizers (ECDQ). We propose two techniques, one based on successive reenement (SR), and the other a dithered and periodic version of the m...
متن کاملAbstract KeLP
1 Abstract We describe a set of abstractions for managing elaborate irregular data structures that communicate within Cartesian subspaces. These abstractions have been implemented as part of KeLPTools, a joint eeort involving research groups at UCSD and LBNL. We discuss the application of KeLPTools to a challenging problem involving structured adaptive mesh reenement, and discuss progress to da...
متن کاملParallelizing Subgraph Isomorphism Reenement for Classiication and Retrieval of Conceptual Structures 3 a Relation-based Representation For
abstract Major applications of graph-based knowledge representations will require quick response times on extremely large knowledge bases. Although algorithmic developments have provided tremendous improvements in speed, we believe implementation on parallel processors will be needed to meet long-term needs. This paper presents a new parallelization of a subgraph isomorphism reenement algorithm...
متن کاملPerforming Algorithmic Reenement before Data Reenement in B Performing Algorithmic Reenement before Data Reenement in B
Algorithmic Reenement is part of the theory of the B method both at the reenement and implementation stages. It a sign of how little loop introduction is used in practice at the reenement stage that neither the B-Toolkit nor Atelier-B provide support for loop introduction until the implementation stage. This paper examines the use of algorithmic reenement in general before data reenement. This ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994